Analyzing Extended Secret Sharing Schemes based on Share Size

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Analyzing Extended Secret Sharing Schemes based on Share Size

Secret sharing is the technique in which secret is distributed among n participants. Each participant has unique secret share. Secret can be recovered only after sufficient number of shares (k out of n) combined together. In many circumstances secret sharing has to provide additional capabilities to satisfy certain requirements. Such capabilities include proactive redistribution of shares, veri...

متن کامل

Ideal Secret Sharing Schemes with Share Selectability

In this paper, we investigate a new concept, called share selectable secret sharing, where no unauthorized set can obtain information of the secret (in the information-theoretic sense) even if shares are selectable as arbitrary values which are independent of the secret. We propose two totally selectable (i.e., all users’ shares are selectable) secret sharing schemes with unanimous structure. W...

متن کامل

On Secret Sharing Schemes with Extended Capabilities

Secret sharing allows split control over the secret. Secret parts known as secret shares are distributed to different shareholders (locations). Secret can be recovered upon combination of sufficient number of shares. Research into theoretical foundations, development of widespread applications, as well as, new attacks resulted in great need for extra features of existing schemes. We describe ex...

متن کامل

On Secret Sharing Schemes

The concept of secret sharing has been introduced independently by Shamir and Blakley, as a tool to protect a secret from getting exposed or from being lost. It allows a so-called dealer to share a secret among the members of a set P , which are usually called players or participants, in such a way that only certain specified subsets of players are able to reconstruct the secret while smaller s...

متن کامل

Secret Sharing Schemes Based on Room Squares

In this paper, we describe secret sharing schemes. We discuss Room squares and their critical sets. We propose a model of secret sharing based on critical sets of Room squares.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Computer Applications

سال: 2015

ISSN: 0975-8887

DOI: 10.5120/20889-3667